Informovanost studentů LF o hospicové péči

LF in LF: Mechanizing the Metatheory of LF in Twelf

We present a mechanized proof of the metatheory of LF, i.e. the decidability of typechecking and the existence and uniqueness of canonical forms. We use a syntactic approach in which we define a translation from LF to its canonical forms presentation (in which only beta-short, eta-long terms are well-formed) and prove soundness and completeness of the translation, establishing that definitional...

Deforesting Lf

This grand aspiration subsumes the more modest research goal of simply characterizing the knowledge that people have of their native languages. Given this overlap in aims, it makes sense to leverage whatever is known about language itself in the pursuit of computational models of language use. Indeed, in confronting such a daunting challenge it would be foolish to waste intellectual resources d...

Compiler Veriication in Lf

We sketch a methodology for the veriication of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this technique to specify, implement, and verify a compiler from a simple functional programming language to a variant of the Categorical Abstract Machine (CAM).

Compiler Verification in LF

We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this technique to specify, implement, and verify a compiler from a simple functional programming language to a variant of the Categorical Abstract Machine (CAM).

LF-frequency domain analysis